Structural complexity theory

Results: 144



#Item
91American Recovery and Reinvestment Act / History of the United States / Computational complexity theory / Reduction / Structural complexity theory

?r , North Carolina Department of Health and Human Services Division of Budget and Analysis

Add to Reading List

Source URL: www.ncdhhs.gov

Language: English - Date: 2013-03-05 11:24:36
92Reduction / Structural complexity theory / Probably approximately correct learning / Big O notation / Theoretical computer science / Applied mathematics / Computational complexity theory

PAC Subset Selection in Stochastic Multi-armed Bandits

Add to Reading List

Source URL: icml.cc

Language: English - Date: 2012-06-07 13:20:18
93NP-complete problems / Mathematical optimization / Job shop scheduling / Operations research / Structural complexity theory / Metric k-center / Algorithm / Dominating set / NP / Theoretical computer science / Computational complexity theory / Mathematics

Approximation Algorithms (ADM III)

Add to Reading List

Source URL: www.coga.tu-berlin.de

Language: English - Date: 2012-11-28 07:19:02
94Probabilistic complexity theory / Structural complexity theory / NP-complete problems / Approximation algorithms / 2-satisfiability / L-reduction / Reduction / PCP theorem / Probabilistically checkable proof / Theoretical computer science / Applied mathematics / Computational complexity theory

Approximation Algorithms (ADM III)

Add to Reading List

Source URL: www.coga.tu-berlin.de

Language: English - Date: 2013-02-14 13:17:57
95Complexity classes / Conjectures / Mathematical optimization / P versus NP problem / Structural complexity theory / NP / Theoretical computer science / Mysteries / Applied mathematics

Chapter 7 – General information • CMDh accepted to take over the responsibility for handling/publishing some of the information contained in NtA, Chapter 7 (General information) • Identify sections that will be tak

Add to Reading List

Source URL: www.hma.eu

Language: English - Date: 2011-11-25 05:45:43
96Complexity classes / Mathematical optimization / NP-complete problems / Structural complexity theory / NP-complete / NP / Boolean satisfiability problem / P versus NP problem / 2-satisfiability / Theoretical computer science / Computational complexity theory / Applied mathematics

Phase transitions in NP-complete problems: a challenge for probability, combinatorics, and computer science Cristopher Moore University of New Mexico and the Santa Fe Institute

Add to Reading List

Source URL: tuvalu.santafe.edu

Language: English - Date: 2010-10-12 20:57:56
97Logic programming / Logic in computer science / Non-classical logic / Structural complexity theory / Complexity classes / Stable model semantics / Answer set programming / Fuzzy logic / Negation / Theoretical computer science / Applied mathematics / Mathematics

Complexity of fuzzy answer set programming under Lukasiewicz semantics Marjon Blondeela,1 , Steven Schockaertb , Dirk Vermeira , Martine De Cockc a Vrije Universiteit Brussel, Department of Computer Science, Pleinlaan 2

Add to Reading List

Source URL: www.cwi.ugent.be

Language: English - Date: 2013-10-21 12:32:43
98Functions and mappings / Structural complexity theory / Polynomials / NP / Multivalued function / PP / Oracle machine / Function / IP / Theoretical computer science / Mathematics / Computational complexity theory

A Hierarchy Based on Output Multiplicity Ashish V. Naik John D. Rogers†

Add to Reading List

Source URL: www.cse.buffalo.edu

Language: English - Date: 1997-10-21 09:09:21
99Computability theory / Structural complexity theory / Complexity classes / Mathematical optimization / NP-complete / P versus NP problem / Turing reduction / Oracle machine / Time complexity / Theoretical computer science / Computational complexity theory / Applied mathematics

Reductions between Disjoint NP-Pairs Christian Glaßer ∗ ¨ Informatik IV

Add to Reading List

Source URL: www.cse.buffalo.edu

Language: English - Date: 2003-04-21 14:49:45
100Complexity classes / Probabilistic complexity theory / Structural complexity theory / Arthur–Merlin protocol / Karp–Lipton theorem / Quantum complexity theory / NP / Interactive proof system / IP / Theoretical computer science / Computational complexity theory / Applied mathematics

Polylogarithmic-round Interactive Proofs for coNP Collapse the Exponential Hierarchy Alan L. Selman ∗

Add to Reading List

Source URL: www.cse.buffalo.edu

Language: English - Date: 2004-02-23 11:23:03
UPDATE